A framework for the response time analysis of fixed-priority tasks with stochastic inter-arrival times

摘要

Real-time scheduling usually considers worst-case values for theparameters of task (or message stream) sets, in order to providesafe schedulability tests for hard real-time systems. However,worst-case conditions introduce a level of pessimism that is ofteninadequate for a certain class of (soft) real-time systems. In thispaper we provide an approach for computing the stochasticresponse time of tasks where tasks have inter-arrival timesdescribed by discrete probabilistic distribution functions, insteadof minimum inter-arrival (MIT) values.